Constructing QUD trees
نویسنده
چکیده
We discuss and combine representation formats for discourse structure, in particular ’d-trees’ from QUD theory and SDRT graphs. QUD trees are derived from SDRT graphs, while changes must apply to QUD theory in order to allow for representations of naturalistic data. We discuss whether QUDs can replace discourse relations. We apply a new method for the identification of implicit Questions under Discussion (QUDs) to examples from an interview, and we address the status of non-at-issue content within our framework.
منابع مشابه
Quantized Dual Graded Graphs
We study quantized dual graded graphs, which are graphs equipped with linear operators satisfying the relation DU − qUD = rI. We construct examples based upon: the Fibonacci differential poset, permutations, standard Young tableau, and plane binary trees.
متن کاملThe " Crisis in Fundamental Physics " -will the Lhc Pomeron End It ? *
SU(5) gauge theory with massless left-handed fermions in the representation 5 ⊕ 15 ⊕ 40 ⊕ 45 * (QUD) may have a bound-state S-Matrix that, uniquely, contains the asymptotically unitary Critical Pomeron and which might also reproduce the full Standard Model. If so, QUD would provide an underlying unification for the Standard Model in which very similar massless fermion anomaly dynamics is respon...
متن کاملOn the Prosodic Coding of Focus in Paraguayan Guaraní
An utterance conveys meaning not just through the words that are uttered (and the way these words combine to form larger expressions), but also through its prosody, i.e. its rhythm and tune. The contribution of prosody to the truth-conditional meaning of an utterance as well as to its informationstructural meaning, i.e. the way in which the utterance is used in discourse, is determined at the i...
متن کاملAboutness topic, discourse topic and the structure of discourse
The paper addresses the relation between several dimensions along which discourse has been assumed to be structured – topical structure, hierarchical structure, QUD-structure and thematic structure – and points at previously undescribed mismatches between those. BACKGROUND ASSUMPTIONS: As discourse progresses, the aboutness topic of a sentence (Reinhart, 1981; Roberts, 2011; Krifka, 2007) may r...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کامل